Multi-Layer Combinatorial Fusion Using Cognitive Diversity
نویسندگان
چکیده
منابع مشابه
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملMulti-layer cognitive filtering by behavioral modeling
In the absence of legal enforcement procedures for the participants of an open e-marketplace, trust and reputation systems are central for resisting against threats from malicious agents. Such systems provide mechanisms for identifying the participants who disseminate unfair ratings. However, it is possible that some of the honest participants are also victimized as a consequence of the poor ju...
متن کاملSome Combinatorial Optimization Schemes for Multi-Layer Network Topology
The article addresses combinatorial optimization schemes for design of multi-layer communication network topology. The paper consists of three parts: (a) description of system issues as basic requirements, trends (e.g., evolution, upgradeability), and a ”system space” for contemporary network design; (b) brief description of some basic combinatorial optimization problems as follows: multicriter...
متن کاملNew full adders using multi-layer perceptron network
How to reconfigure a logic gate for a variety of functions is an interesting topic. In this paper, a different method of designing logic gates are proposed. Initially, due to the training ability of the multilayer perceptron neural network, it was used to create a new type of logic and full adder gates. In this method, the perceptron network was trained and then tested. This network was 100% ac...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2020.3047057